Embedding Planar Graphs in Seven Pages
نویسنده
چکیده
This paper investigates the problem of embedding planar graphs in books of few pages. An efficient algorithm for embedding a planar graph in a book establishes an upper bound of seven pages for any planar graph. This disproves a conjecture of Bernhart and Kainen that the pagenumber of a planar graph can be arbitrarily large. I t is also shown that the stellations of K3 have pagenumber three, the best possible.
منابع مشابه
Algorithms for Embedding Graphs in Books
We investigate the problem ol embedding graphs in boob. A book is some number or halfplanes (the page• or the book), which share a common line as boundary (the qine or the book). A book embedding or a graph embeds the vertices on the spine in some order and embeds each edge in some page so that in each page no two edges intersect. The pagenumber ol a graph is the number or pages in a minimum-pa...
متن کاملOn the Book Thickness of 1-Planar Graphs
In a book embedding of a graph G, the vertices of G are placed in order along a straight-line called spine of the book, and the edges of G are drawn on a set of half-planes, called the pages of the book, such that two edges drawn on a page do not cross each other. The minimum number of pages in which a graph can be embedded is called the book-thickness or the page-number of the graph. It is kno...
متن کاملExtremal Graph Theory for Book-Embeddings
A book-embedding of a graph is a linear ordering of its vertices, and a partition of its edges into non-crossing sets (called pages). The pagenumber of a graph is the minimum number of pages for which it has a book-embedding. After introducing concepts relevant to book-embeddings and their applications, we will describe the main results on the pagenumber for classes of graphs, particularly resu...
متن کاملTwo-page Book Embedding and Clustered Graph Planarity
A 2-page book embedding of a graph places the vertices linearly on a spine (a line segment) and the edges on two pages (two half planes sharing the spine) so that each edge is embedded in one of the pages without edge crossings. Testing whether a given graph admits a 2-page book embedding is known to be NP-complete. In this paper, we study the problem of testing whether a given graph admits a 2...
متن کاملThe pagenumber of toroidal graphs is at most seven
In this paper, we show that seven pages are sufficient for a book embedding of any toroidal graph.
متن کامل